User Activity Detection for Irregular Repetition Slotted Aloha Based MMTC

نویسندگان

چکیده

Irregular repetition slotted aloha (IRSA) is a grant-free random access protocol for massive machine-type communications, where large number of users sporadically send their data packets to base station (BS). IRSA completely distributed multiple protocol: in any given frame, small subset the users, i.e., active transmit replicas packet randomly selected resource elements (REs). The first step decoding process at BS detect which are each frame. To this end, novel Bayesian user activity detection (UAD) algorithm developed, exploits both sparsity as well underlying structure IRSA-based transmissions. Next, Cramer-Rao bound (CRB) on mean squared error channel estimation derived. It empirically shown that estimates obtained by-product proposed UAD achieves CRB. Then, signal interference plus noise ratio achieved by analyzed, accounting UAD, errors, and pilot contamination. impact these non-idealities throughput illustrated via Monte Carlo simulations. For example, system with 1500 10% being per length low 20 symbols sufficient accurate detection. In contrast, using classical compressed sensing approaches would require about 346 symbols. results also reveal crucial insights into dependence errors parameters such sequence, antennas BS, ratio.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian Multiple Access Channel

We address the problem of massive random access for an uncoordinated Gaussian multiple access channel (MAC). The performance of T-fold irregular repetition slotted ALOHA (IRSA) scheme for this channel is investigated. The main difference of this scheme in comparison to IRSA is as follows: any collisions of order up to T can be resolved with some probability of error introduced by Gaussian noise...

متن کامل

Finite Length Analysis of Irregular Repetition Slotted ALOHA in the Waterfall Region

A finite length analysis is introduced for irregular repetition slotted ALOHA (IRSA) that enables to accurately estimate its performance in the moderate-to-high packet loss probability regime, i.e., in the so-called waterfall region. The analysis is tailored to the collision channel model, which enables mapping the description of the successive interference cancellation process onto the iterati...

متن کامل

User registration in broadband slotted Aloha networks

This paper proposes an algorithm for user terminals in broadband slotted Aloha networks to jointly succeed in time synchronization, power adjustment, and registration to the network control center. The performance is analyzed considering nonnegligible initial time uncertainty, nonnegligible power uncertainty, and minimizing cochannel interference as well as binary feedback from the central rece...

متن کامل

User Divided Slotted Aloha Channel for Packet Delay Control

User divided slotted ALOHA channel is proposed for packet delay control. Packet delay is one of the serious problem in slotted ALOHA system, especially when the system contains users who transmit time constrained data, such as digitized voice packet. In the proposed method, users are divided into time constrained users (voice users) and time no-constrained users (data users). Time axis is divid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2022

ISSN: ['1053-587X', '1941-0476']

DOI: https://doi.org/10.1109/tsp.2022.3185891